Semistrict -Preinvexity and Optimality in Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
Semistrict G-Preinvexity and Optimality in Nonlinear Programming
and Applied Analysis 3 Proof. Let x, y ∈ K. From the assumption of f(y+η(x, y)) ≤ f(x), when λ = 0, 1, we can know that f (y + λη (x, y)) ≤ G −1 (λG (f (x)) + (1 − λ)G (f (y))) . (9) Then, there are two cases to be considered. (i) Iff(x) ̸ = f(y), then by the semistrictG-preinvexity of f, we have the following:
متن کاملParametrically Robust Optimality in Nonlinear Programming*
In nonlinear programming, the strong second-order optimality condition and the linearly independent gradient condition have many uses. In particular, the first guarantees that a point is an isolated locally optimal solution, while the second insures the uniqueness of the associated multiplier vector, but other, less stringent assumptions would already be enough for that. In fact, the combinatio...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/103864